An algebraic analysis of the graph modularity

One of the most relevant tasks in network analysis is the detection of community structures, or clustering. Most popular techniques for community detection are based on the maximization of a quality function called modularity, which in turn is based upon particular quadratic forms associated to a real symmetric modularity matrix M , defined in terms of the adjacency matrix and a rank one null model matrix. That matrix could be posed inside the set of relevant matrices involved in graph theory, alongside adjacency and Laplacian matrices. In this paper we analyze certain spectral properties of modularity matrices, that are related to the community detection problem. In particular, we propose a nodal domain theorem for the eigenvectors of M ; we point out several relations occurring between graph’s communities and nonnegative eigenvalues of M ; and we derive a Cheeger-type inequality for the graph modularity.